Streaming from MIDI Using Constraint Satisfaction Optimization and Sequence Alignment
نویسندگان
چکیده
We present a new system for separating streams in musical pieces encoded as MIDI files. Our approach is to: (1) divide the music under analysis into short segments, (2) analyze each segment using constraint satisfaction optimization, and (3) connect these analyses using a sequence alignment algorithm. Parameters for the system are learned automatically on a small training corpus and generalize reasonably well across a variety of pieces. We report performance results on 108 pieces of Baroque, Classical, and Romantic music: J.S. Bach’s two-part inventions (0.95 accuracy by the F-measure), three-part sinfonias (0.92), and fugues from the Well-Tempered Clavier, book I (0.93) and book II (0.92); and string quartets by Haydn (0.81) and Brahms (0.76).
منابع مشابه
Lot Streaming in No-wait Multi Product Flowshop Considering Sequence Dependent Setup Times and Position Based Learning Factors
This paper considers a no-wait multi product flowshop scheduling problem with sequence dependent setup times. Lot streaming divide the lots of products into portions called sublots in order to reduce the lead times and work-in-process, and increase the machine utilization rates. The objective is to minimize the makespan. To clarify the system, mathematical model of the problem is presented. Sin...
متن کاملEnhancing infill sampling criteria for surrogate-based constrained optimization
Apopular approach to handling constraints in surrogate-based optimization is through the additionof penalty functions to an infill sampling criterion that seeks objective improvement. Typical samplingmetrics, such as expected improvement tend to have multimodal landscapes and can be difficult to search. When the problem is transformed using a penalty approach the search can become riddled with ...
متن کاملTrace - Based Methods for Solving
In this paper we present a method called NOVEL (Nonlinear Optimization via External Lead) for solving continuous and discrete global optimization problems. NOVEL addresses the balance between global search and local search, using a trace to aid in identifying promising regions before committing to local searches. We discuss NOVEL for solving continuous constrained optimization problems and show...
متن کاملProfit maximization solid transportation problem under budget constraint using fuzzy measures
Fixed charge solid transportation problems are formulated as profit maximization problems under a budget constraint at each destination. Here item is purchased in different depots at different prices. Accordingly the item is transported to different destinations from different depots using different vehicles. Unitsare sold from different destinations to the customers at different selling prices...
متن کاملStreaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph
We study the complexity of estimating the optimum value of a Boolean 2CSP (arity two constraint satisfaction problem) in the single-pass streaming setting, where the algorithm is presented the constraints in an arbitrary order. We give a streaming algorithm to estimate the optimum within a factor approaching 2/5 using logarithmic space, with high probability. This beats the trivial factor 1/4 e...
متن کامل